1,531 research outputs found
Quantum and random walks as universal generators of probability distributions
Quantum walks and random walks bear similarities and divergences. One of the
most remarkable disparities affects the probability of finding the particle at
a given location: typically, almost a flat function in the first case and a
bell-shaped one in the second case. Here I show how one can impose any desired
stochastic behavior (compatible with the continuity equation for the
probability function) on both systems by the appropriate choice of time- and
site-dependent coins. This implies, in particular, that one can devise quantum
walks that show diffusive spreading without loosing coherence, as well as
random walks that exhibit the characteristic fast propagation of a quantum
particle driven by a Hadamard coin.Comment: 8 pages, 2 figures; revised and enlarged versio
Two-Player Reachability-Price Games on Single-Clock Timed Automata
We study two player reachability-price games on single-clock timed automata.
The problem is as follows: given a state of the automaton, determine whether
the first player can guarantee reaching one of the designated goal locations.
If a goal location can be reached then we also want to compute the optimum
price of doing so. Our contribution is twofold. First, we develop a theory of
cost functions, which provide a comprehensive methodology for the analysis of
this problem. This theory allows us to establish our second contribution, an
EXPTIME algorithm for computing the optimum reachability price, which improves
the existing 3EXPTIME upper bound.Comment: In Proceedings QAPL 2011, arXiv:1107.074
LTL Parameter Synthesis of Parametric Timed Automata
The parameter synthesis problem for parametric timed automata is undecidable
in general even for very simple reachability properties. In this paper we
introduce restrictions on parameter valuations under which the parameter
synthesis problem is decidable for LTL properties. The investigated bounded
integer parameter synthesis problem could be solved using an explicit
enumeration of all possible parameter valuations. We propose an alternative
symbolic zone-based method for this problem which results in a faster
computation. Our technique extends the ideas of the automata-based approach to
LTL model checking of timed automata. To justify the usefulness of our
approach, we provide experimental evaluation and compare our method with
explicit enumeration technique.Comment: 23 pages, extended versio
A Simulator for LLVM Bitcode
In this paper, we introduce an interactive simulator for programs in the form
of LLVM bitcode. The main features of the simulator include precise control
over thread scheduling, automatic checkpoints and reverse stepping, support for
source-level information about functions and variables in C and C++ programs
and structured heap visualisation. Additionally, the simulator is compatible
with DiVM (DIVINE VM) hypercalls, which makes it possible to load, simulate and
analyse counterexamples from an existing model checker
- …